On constructing trellis codes with large free distances and low decoding complexities
نویسندگان
چکیده
We propose a trellis-coding scheme for which large free distances and low decoding complexities can be easily achieved. The proposed trellis-coding scheme is a generalization of the trellis-coding scheme proposed by Hellstern. With the proposed trellis-coding scheme, we have the flexibility of controlling the decoding delay.
منابع مشابه
Variable-complexity trellis decoding of binary convolutional codes
We consider trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance “near” that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best accord...
متن کاملA Note on Performance of Generalized Tail Biting Trellis Codes
Tail biting trellis codes and block concatenated codes are discussed from random coding arguments. Error exponents and decoding complexity for generalized tail biting (GTB) random trellis codes, and their relationships are derived, where the GTB trellis codes consist of full tail biting (FTB) trellis codes, partial tail biting (PTB) trellis codes and direct truncated (DT) trellis codes. We show...
متن کاملMultidimensional trellis coded phase modulation using a multilevel concatenation approach. I. Code design
-The first part of this paper presents a simple and systematic technique for constructing multidimensional M-ary phase shift keying (MPSK) trellis coded modulation (TCM) codes. The construction is based on a multilevel concatenation approach, in which binary convohitionai codes with good free branch distances are used as the outer codes and block MPSK modulation codes are used as the inner code...
متن کاملCodes and Decoding on General Graphs
Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithms are special cases of two generic algorithms, the min-sum and sum-product algorithms, which also...
متن کاملConstructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity
In this correspondence, constructions of generalized concatenated (GC) codes with good rates and distances are presented. Some of the proposed GC codes have simpler trellis complexity than Euclidean geometry (EG), Reed–Muller (RM), or Bose–Chaudhuri–Hocquenghem (BCH) codes of approximately the same rates and minimum distances, and in addition can be decoded with trellis-based multistage decodin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Communications
دوره 45 شماره
صفحات -
تاریخ انتشار 1997